runtime.mheap.arenas (field)

25 uses

	runtime (current package)
		heapdump.go#L517: 	for i1 := range mheap_.arenas {
		heapdump.go#L518: 		if mheap_.arenas[i1] == nil {
		heapdump.go#L521: 		for i, ha := range mheap_.arenas[i1] {
		malloc.go#L758: 		l2 := h.arenas[ri.l1()]
		malloc.go#L777: 			atomic.StorepNoWB(unsafe.Pointer(&h.arenas[ri.l1()]), unsafe.Pointer(l2))
		malloc.go#L913: 	for i := range h.arenas {
		malloc.go#L914: 		l2 := (*[1 << arenaL2Bits]*heapArena)(atomic.Loadp(unsafe.Pointer(&h.arenas[i])))
		mcheckmark.go#L43: 		arena := mheap_.arenas[ai.l1()][ai.l2()]
		mcheckmark.go#L90: 	arena := mheap_.arenas[ai.l1()][ai.l2()]
		mgc.go#L1754: 		ha := mheap_.arenas[ai.l1()][ai.l2()]
		mgcmark.go#L344: 	ha := mheap_.arenas[ai.l1()][ai.l2()]
		mheap.go#L147: 	arenas [1 << arenaL1Bits]*[1 << arenaL2Bits]*heapArena
		mheap.go#L685: 		if ri.l2() >= uint(len(mheap_.arenas[0])) {
		mheap.go#L690: 		if ri.l1() >= uint(len(mheap_.arenas)) {
		mheap.go#L694: 	l2 := mheap_.arenas[ri.l1()]
		mheap.go#L713: 	return mheap_.arenas[ai.l1()][ai.l2()].spans[(p/pageSize)%pagesPerArena]
		mheap.go#L739: 	arena = mheap_.arenas[ai.l1()][ai.l2()]
		mheap.go#L880: 		ha := h.arenas[ai.l1()][ai.l2()]
		mheap.go#L1004: 	ha := h.arenas[ai.l1()][ai.l2()]
		mheap.go#L1009: 			ha = h.arenas[ai.l1()][ai.l2()]
		mheap.go#L1028: 		ha := h.arenas[ai.l1()][ai.l2()]
		mheap.go#L1853: 	ha := mheap_.arenas[ai.l1()][ai.l2()]
		mheap.go#L1861: 	ha := mheap_.arenas[ai.l1()][ai.l2()]
		mpagealloc.go#L617: 	if p.test || mheap_.arenas[ai.l1()] == nil || mheap_.arenas[ai.l1()][ai.l2()] == nil {